Forward-Reverse Observational Equivalences in CCSK

نویسندگان

چکیده

In the context of CCSK, a reversible extension CCS, we study observational equivalences that distinguish forward moves from backward ones. We present refinement notion forward-reverse bisimilarity and show it coincides with barbed congruence. also set sound axioms allowing one to reason equationally on process equivalences.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving More Observational Equivalences with ProVerif

This paper presents an extension of the automatic protocol verifier ProVerif in order to prove more observational equivalences. ProVerif can prove observational equivalence between processes that have the same structure but differ by the messages they contain. In order to extend the class of equivalences that ProVerif handles, we extend the language of terms by defining more functions (destruct...

متن کامل

Observational Equivalences for Logic Programs 1

We rst introduce a general semantic scheme for logic programs which provides a uniform framework for deening diierent compositional semantics parametrically wrt a given notion of observable. The equivalence of the operational (top-down) and xpoint (bottom-up) costruction of the semantics is ensured by the scheme (provided a congruence property is veriied). We then deene several observational eq...

متن کامل

Reverse Engineering is Reverse Forward Engineering

Reverse Engineering is focused on the challenging task of understanding legacy program code without having suitable documentation. Using a transformational forward engineering perspective, we gain the insight that much of this difficulty is caused by design decisions made during system development. Such decisions “hide” the program functionality and performance requirements in the final system ...

متن کامل

Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic

We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less restrictive framework of proof structures, and then in adapting the results to proof nets. At the level of proof structures, we find a semantical characterization of their interpretations in relational semantics, and we...

متن کامل

Equivalences in Bicategories

In this paper, we establish some connections between the concept of an equivalence of categories and that of an equivalence in a bicategory. Its main result builds upon the observation that two closely related concepts, which could both play the role of an equivalence in a bicategory, turn out not to coincide. Two counterexamples are provided for that goal, and detailed proofs are given. In par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-79837-6_8